Nonsplit domination number in vertex semi-middle graph
نویسندگان
چکیده
Let G(p, q) be a connected graph and Mv (G) its corresponding vertex semi middle graph. A dominating set D⊆V[Mv (G)] is Nonsplit 〈V[Mv (G)]-D〉 connected. The minimum size of D called the domination number denoted by γns [Mv (G)]. In this paper we obtain several results on number.
منابع مشابه
Nonsplit Dom Strong Domination Number Of A Graph
A subset D of V is called a dom strong dominating set if for every v V – D, there exists u1, u2 D such that u1v, u2v E(G) and deg (u1 ) ≥ deg (v). The minimum cardinality of a dom strong dominating set is called dom strong domination number and is denoted by γdsd. In this paper, we introduce the concept of nonsplit dom strong domination number of a graph. A dom strong dominating set D of a ...
متن کاملDomination number of graph fractional powers
For any $k in mathbb{N}$, the $k$-subdivision of graph $G$ is a simple graph $G^{frac{1}{k}}$, which is constructed by replacing each edge of $G$ with a path of length $k$. In [Moharram N. Iradmusa, On colorings of graph fractional powers, Discrete Math., (310) 2010, No. 10-11, 1551-1556] the $m$th power of the $n$-subdivision of $G$ has been introduced as a fractional power of $G$, denoted by ...
متن کاملNonsplit Domination Edge Critical Graphs
A set of vertices S is said to dominate the graph G if for each v / ∈ S, there is a vertex u ∈ S with u adjacent to v. The minimum cardinality of any dominating set is called the domination number of the graph G and is denoted by γ(G). A dominating set D of a graph G = (V,E) is a nonsplit dominating set if the induced graph 〈V − D〉 is connected. The nonsplit domination number γns(G) of the grap...
متن کاملDOMINATION NUMBER OF TOTAL GRAPH OF MODULE
Let $R$ be a commutative ring and $M$ be an $R$-module with $T(M)$ as subset, the set of torsion elements. The total graph of the module denoted by $T(Gamma(M))$, is the (undirected) graph with all elements of $M$ as vertices, and for distinct elements $n,m in M$, the vertices $n$ and $m$ are adjacent if and only if $n+m in T(M)$. In this paper we study the domination number of $T(Gamma(M))$ a...
متن کاملThe convex domination subdivision number of a graph
Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of statistics and applied mathematics
سال: 2022
ISSN: ['2456-1452']
DOI: https://doi.org/10.22271/maths.2022.v7.i4b.850